By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 18, Issue 3, pp. 429-638

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A Design Theory for Solving the Anomalies Problem

Edward P. F. Chan

pp. 429-448

BibTeX  Abstract Full Text:  PDF

On Tally Relativizations of $BP$-Complexity Classes

Shouwen Tang and Osamu Watanabe

pp. 449-462

BibTeX  Abstract Full Text:  PDF

Dynamic Programming by Exchangeability

Shuo-Yen Robert Li

pp. 463-472

BibTeX  Abstract Full Text:  PDF

Optimal Bin Packing with Items of Random Sizes III

WanSoo T. Rhee and Michel Talagrand

pp. 473-486

BibTeX  Abstract Full Text:  PDF

Optimal Bin Covering with Items of Random Size

WanSoo T. Rhee and Michel Talagrand

pp. 487-498

BibTeX  Abstract Full Text:  PDF

Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms

Mikhail J. Atallah, Richard Cole, and Michael T. Goodrich

pp. 499-532

BibTeX  Abstract Full Text:  PDF

A New Pebble Game that Characterizes Parallel Complexity Classes

H. Venkateswaran and Martin Tompa

pp. 533-549

BibTeX  Abstract Full Text:  PDF

Succinct Certificates for Almost All Subset Sum Problems

Merrick L. Furst and Ravi Kannan

pp. 550-558

BibTeX  Abstract Full Text:  PDF

Two Applications of Inductive Counting for Complementation Problems

Allan Borodin, Stephen A. Cook, Patrick W. Dymond, Walter L. Ruzzo, and Martin Tompa

pp. 559-578

BibTeX  Abstract Full Text:  PDF

Note on Weintraub's Minimum-Cost Circulation Algorithm

Francisco Barahona and éva Tardos

pp. 579-583

BibTeX  Abstract Full Text:  PDF

Fast Fourier Transforms for Metabelian Groups

Michael Clausen

pp. 584-593

BibTeX  Abstract Full Text:  PDF

Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

Sanguthevar Rajasekaran and John H. Reif

pp. 594-607

BibTeX  Abstract Full Text:  PDF

Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for $GF(q)[x]$

G. H. Norton

pp. 608-624

BibTeX  Abstract Full Text:  PDF

Expressibility and Parallel Complexity

Neil Immerman

pp. 625-638

BibTeX  Abstract Full Text:  PDF